A recurrence relation for the square root

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the square root of quadratic matrices

Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.

متن کامل

Newton's Method for the Matrix Square Root*

One approach to computing a square root of a matrix A is to apply Newton's method to the quadratic matrix equation F( X) = X2 A =0. Two widely-quoted matrix square root iterations obtained by rewriting this Newton iteration are shown to have excellent mathematical convergence properties. However, by means of a perturbation analysis and supportive numerical examples, it is shown that these simpl...

متن کامل

Improving Goldschmidt Division, Square Root, and Square Root Reciprocal

ÐThe aim of this paper is to accelerate division, square root, and square root reciprocal computations when the Goldschmidt method is used on a pipelined multiplier. This is done by replacing the last iteration by the addition of a correcting term that can be looked up during the early iterations. We describe several variants of the Goldschmidt algorithm, assuming 4-cycle pipelined multiplier, ...

متن کامل

A square root of the harmonic oscillator

Allowing for the inclusion of the parity operator, it is possible to construct a model of an oscillator whose Hamiltonian admits an exact square root which is rather different from the conventional approach based on creation and annihilation operators. We outline such a model, the method of solution and some generalisations. 03.65.Ge, 03.65.Fd Typeset using REVTEX In memory of Lorella M Jones w...

متن کامل

The Computational Square-Root Exponent

In this paper, we revisit the Computational Square-Root Exponent Problem (CSREP), and give a more generic condition such that CSREP is polynomial-time equivalent to the Computational DiffieHellman Problem (CDHP) in the group with prime order. The results obtained in this paper contain Zhang et al.’s results at IWCC2011. We also analyze the existence of such condition. Although primes satisfying...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1973

ISSN: 0021-9045

DOI: 10.1016/0021-9045(73)90075-0